A finite model construction for coalgebraic modal logic

A Finite Model Construction for Coalgebraic Modal Logic

In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove that (finitary) coalgebraic modal logic has the finite model property. This fact not only reproves known completeness results for coalgebraic modal logic, which we push further by establishing that every coalgebraic modal...

Coalgebraic modal logic of finite rank

Coalgebraic Modal Logic in CoCasl

We extend the algebraic-coalgebraic specification language CoCasl by full coalgebraic modal logic based on predicate liftings for functors. This logic is more general than the modal logic previously used in CoCasl and supports the specification of a variety of modal logics, such as graded modal logic, majority logic, and probabilistic modal logic. CoCasl thus becomes a modern modal language tha...

Coalgebraic Modal Logic Beyond Sets

Polyadic coalgebraic modal logic is studied in the setting of locally presentable categories. It is shown that under certain assumptions, accessible functors admit expressive logics for their coalgebras. Examples include typical functors used to describe systems with name binding, interpreted in nominal sets.

A coalgebraic view on positive modal logic

Positive Modal Logic is the restriction of the modal local consequence relation defined by the class of all Kripke models to the propositional negation-free modal language. The class of positive modal algebras is the one canonically associated with PML according to the theory of the algebrization of logics [12]. A Priestley-style duality is established between the category of positive modal alg...